Exponential distributions in Markov chain models for communication channels

A brief history of Markov chain models for communication channels is given. One such model, the most complicated devised to date, is discussed in more detail. For this model, some statistics are presented in terms of sums of exponential functions. As an example, error free runs of two of the numerous trophospheric channels for which we have chosen parameters are studied here

Mutual protection of co-operating agents

Abstract. Security is a fundamental precondition for the acceptance of mobile agent systems. In this paper we discuss protocols to improve agent security by distributing critical data and operations on mutually supporting agents which migrate in disjunct host domains. In order to attack agents, hosts must collude/conspire across domains. Proper selection of itineraries can minimize the risk of such coalitions being formed